Comparison of Decision Diagrams for Multiple-Output Logic Functions
نویسندگان
چکیده
This paper shows four different methods to evaluate multiple-output logic functions using decision diagrams: SBDD, MTBDD, BDD for characteristic functions (CF), and BDDs for ECFNs (Encoded Characteristic Function for Non-zero outputs). Methods to compute average evaluation time for each type of decision diagrams are presented. By experimental analysis using benchmark functions, the number of nodes and average evaluation time are compared. Evaluation using BDDs for ECFN outperforms those using MTBDDs, BDDs for CF, and SBDDs with respect to the size of BDDs and computation time. The sizes of BDDs for ECFNs are smaller than ones of corresponding MTBDDs (Multi-Terminal BDDs), BDDs for CFs (Characteristic Functions), and SBDDs (Shared BDDs).
منابع مشابه
Representations of Multiple-Output Functions Using Binary Decision Diagrams for Characteristic Functions
This paper proposes a method to construct smaller binary decision diagrams for characteristic functions (BDDs for CFs). A BDD for CF represents an n-input m-output function, and evaluates all the outputs in O(n+m) time. We derive an upper bound on the number of nodes of the BDD for CF of n-bit adders (adrn). We also compare complexities of BDDs for CFs with those of shared binary decision diagr...
متن کاملTime-Division Multiplexing Realizations of Multiple-Output Functions Based on Shared Multi-Terminal Multiple-Valued Decision Diagrams
This paper considers methods to design multiple-output networks based on decision diagrams (DDs). TDM (time-division multiplexing) systems transmit several signals on a single line. These methods reduce: 1) hardware; 2) logic levels; and 3) pins. In the TDM realizations, we consider three types of DDs: shared binary decision digrams (SBDDs), shared multiple-valued decision diagrams (SMDDs), and...
متن کاملA Method to Represent Multiple-Output Switching Functions by Using Multi-Valued Decision Diagrams
Multiple-output switching functions can be simulated by multiple-valued decision diagrams (MDDs) at a signi cant reduction in computation time. We analyze the following approaches to the representation problem: shared multiple-valued decision diagrams (SMDDs), multi-terminal multiple-valued decision diagrams (MTMDDs), and shared multi-terminal multiple-valued decision diagrams (SMTMDDs). For ex...
متن کاملImplementation of Multiple-Output Functions Using PQMDDs
A sequential realization of multiple-output logic functions is presented. A conventional sequential realization is based on SBDDs (Shared reduced ordered Binary Decision Diagrams). In this paper, we propose PQMDD (Paged Quasi-reduced ordered Multi-valued Decision Diagram) as a new data structure. A function is represented by a PQMDD, and stored in memory. Dedicated control circuits traverse the...
متن کاملLogic Synthesis of LUT Cascades with Limited Rails
Programmable LUT cascades are used to evaluate multi-output Boolean functions. This paper shows several representations of multi-output functions and introduces a new decomposition algorithm applicable to these representations. The algorithm produces LUT cascades with the limited number of rails, which leads to significantly faster circuits and applicability to large designs. The experiment sho...
متن کامل